Coordination of Pheromone Deposition Might Solve Time-Constrained Travelling Salesman Problem
نویسندگان
چکیده
منابع مشابه
A Study of Genetic Algorithm to Solve Travelling Salesman Problem
This paper presents the literature survey review of Travelling Salesman Problem (TSP). TSP belongs to the category of NP-hard problems. A various number of methods have been designed to solve this problem. Genetic Algorithm is one of the best methods which is used to solve various NP-hard problem such as TSP. The natural evolution process is always used by genetic Algorithm to solve the problem...
متن کاملBioinspired Algorithm Applied to Solve the Travelling Salesman Problem
The article is devoted to the study and development of modified bioinspired algorithm and the experimental studies of its characteristics to solve the travelling salesman problem. This algorithm is part of the swarm intelligence method, which is one of bioinspired approaches describing the collective behavior of a decentralized self-organizing system and consists of a multitude of agents (ants)...
متن کاملHarmony-Scatter Search to Solve Travelling Salesman Problem
This paper presents a hybrid metaheuristic algorithm which is Harmony-Scatter Search (HSS). The HSS provides Scatter Search (SS) with random exploration for search space of problem and more of diversity and intensification for promising solutions. The SS and HSS have been tested on Traveling Salesman Problem. A computational experiment with benchmark instances is reported. The results demonstra...
متن کاملBeam-ACO for the travelling salesman problem with time windows
The travelling salesman problem with time windows is a difficult optimization problem that arises, for example, in logistics. This paper deals with the minimization of the travel-cost. For solving this problem, this paper proposes a Beam-ACO algorithm, which is a hybrid method combining ant colony optimization with beam search. In general, Beam-ACO algorithms heavily rely on accurate and comput...
متن کاملImproving the performance of Approximation algorithm to solve Travelling Salesman Problem using Parallel Algorithm
Travelling salesman problem is a NP complete problem and can be solved using approximation algorithm. It is a minimization problem starting and finishing at a specified vertex after having visited each other vertex exactly once. Often, the model is a complete graph. An algorithm that returns near-optimal solutions is called approximation algorithms. Through analyzing the Metric TSP the performa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complexity
سال: 2018
ISSN: 1076-2787,1099-0526
DOI: 10.1155/2018/6498218